On an anti-Ramsey problem of Burr, Erdös, Graham, and T. Sós
نویسندگان
چکیده
منابع مشابه
On an Anti - Ramsey Problem of Burr , Erdős , Graham , and T . Sós Gábor
Given a graph L, in this article we investigate the anti-Ramsey number χS (n,e,L), defined to be the minimum number of colors needed to edge-color some graph G(n,e) with n vertices and e edges so that in every copy of L inG all edges have different colors. We call such a copy of L totally multicolored (TMC). In [7] among many other interesting results and problems, Burr, Erdős, Graham, and T. S...
متن کاملMaximal antiramsey graphs and the strong chromatic number
A typical problem arising in Ramsey graph theory is the following . For given graphs G and L, how few colors can be used to color the edges of G in order that no monochromatic subgraph isomorphic to L is formed? In this paper we investigate the opposite extreme . That is, we will require that in any subgraph of G isomorphic to L, all its edges have different colors. We call such a subgraph a to...
متن کاملSubdivided graphs have linear ramsey numbers
It is shown that the Ramsey number of any graph with n vertices in which no two vertices of degree at least 3 are adjacent is at most 12n. In particular, the above estimate holds for the Ramsey number of any n-vertex subdivision of an arbitrary graph, provided each edge of the original graph is subdivided at least once. This settles a problem of Burr and Erdös.
متن کاملGeneralizations of a Ramsey-theoretic result of chvátal
Chvátal has shown that if T is a tree on n points then r(Kk , T) _ (k 1 ) (n 1 ) + 1 , where r is the (generalized) Ramsey number. It is shown that the same result holds when T is replaced by many other graphs. Such a T is called kgood. The results proved all support the conjecture that any large graph that is sufficiently sparse, in the appropriate sense, is k-good .
متن کاملOn Ramsey - Turán type theorems for hypergraphs
Let H’ be an r-uniform hypergraph. Let g=g(n; F) be the minimal integer so that any r-uniform hypergraph on n vertices and more than g edges contains a subgraph isomorphic to H’. Let e=f(n; H’, en) denote the minimal integer such that every r-uniform hypergraph on n vertices with more than e edges and with no independent set of .sn vertices contains a subgraph isomorphic to H’. We show that if ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 52 شماره
صفحات -
تاریخ انتشار 2006